Solving MAX-r-SAT Above a Tight Lower Bound
نویسندگان
چکیده
منابع مشابه
Solving MAX-2-SAT Above a Tight Lower Bound
We present an exact algorithm that decides in time m + 2 ) whether a given set of m binary clauses admits a truth assignment that satisfies at least (3m + k)/4 clauses. Thus Max-2-Sat is fixed-parameter tractable when parameterized above the tight lower bound 3m/4. Our algorithm is based on a polynomial-time data reduction procedure that reduces a problem instance to an equivalent one with O(k)...
متن کاملBetweenness parameterized above tight lower bound
We study ordinal embedding relaxations in the realm of parameterized complexity. We prove the existence of a quadratic kernel for the Betweenness problem parameterized above tight lower bound, which is stated as follows. For a set V of variables and set C of constraints “vi is between vj and vk”, decide whether there is a bijection from V to the set {1, . . . , |V |} satisfying at least |C|/3 +...
متن کاملA Probabilistic Approach to Problems Parameterized Above Tight Lower Bound
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds. To illustrate the approach we consider three problems of this type of unknown complexity that were introduced by Mahajan, Raman and Sikdar (J. Comput. Syst. Sci. 75, 2009). We show that a generalization of one of the problems and non-trivial special cases of the other tw...
متن کاملWithin-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving
This paper focuses on improving branch-and-bound Max-SAT solvers by speeding up the lower bound computation. We notice that the existing propagation-based computing methods and the resolution-based computing methods, which have been studied intensively, both suffer from several drawbacks. In order to overcome these drawbacks, we propose a new method with a nice property that guarantees the incr...
متن کاملImproved Kernels for Signed Max Cut Parameterized Above Lower Bound on (r, `)-graphs
A graph G is signed if each edge is assigned + or −. A signed graph is balanced if there is a bipartition of its vertex set such that an edge has sign − if and only if its endpoints are in different parts. The Edwards-Erdös bound states that every graph with n vertices and m edges has a balanced subgraph with at least m 2 +n−1 4 edges. In the Signed Max Cut Above Tight Lower Bound (Signed Max C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2010
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-010-9428-7